A Gilbert-Varshamov type bound for linear codes over Galois rings
نویسندگان
چکیده
In this paper we derive a Gilbert-Varshamov type bound for linear codes over Galois rings. For linear codes over the Galois ring GR(pl; j) the result can be stated as follows. Given r; such that 0 < r < 1 and 0 < H 1 pj (1 r): Then for all n N; where N is a sufficiently large integer, there exist [n; k] GR linear codes over GR(pl; j) such that k=n r and d=n : Consequently, this bound does not guarantee existence of better linear codes over GR(pl; j) than the usual Gilbert-Varshamov bound for linear codes over the residue class field GR(pj): 1 Linear codes over Galois rings A Galois ring R is defined to be a finite commutative local ring with unity, where the maximal ideal m is given by m = pR; p a prime number. The characteristic then is pl for some l 2 N ; and the residue class field is GF (pj) where j 2 N: Except for an isomorphism, R is uniquely determined by pl and j ([3], [2]), and we will let R = GR(pl; j) denote the Galois ring of characteristic pl and residue class field GF (pj): The set of n tuples over R; Rn; is a R module. By a linear code over R we mean any R submodule of Rn: We will denote such a linear code a GR linear code. Both authors are with the Department of Mathematics, Institute for Electronic Systems, Aalborg University DK-9220 Aalborg Ø, Denmark.
منابع مشابه
On Gilbert-Varshamov type bounds for Z2k linear codes
In this paper we derive a Gilbert-Varshamov type bound for linear codes over Galois rings GR(pl; j): However, this bound does not guarantee existence of better linear codes over GR(pl; j) than the usual Gilbert-Varshamov bound for linear codes over the residue class field GR(pj): Next we derive a Gilbert-Varshamov type bound for Z4 linear codes which guarantees the existence of Z4 linear codes ...
متن کاملGilbert-Varshamov type bounds for linear codes over finite chain rings
We obtain finite and asymptotic Gilbert-Varshamov type bounds for linear codes over finite chain rings with various weights.
متن کاملSelf-Dual Codes better than the Gilbert-Varshamov bound
We show that every self-orthogonal code over $\mathbb F_q$ of length $n$ can be extended to a self-dual code, if there exists self-dual codes of length $n$. Using a family of Galois towers of algebraic function fields we show that over any nonprime field $\mathbb F_q$, with $q\geq 64$, except possibly $q=125$, there are self-dual codes better than the asymptotic Gilbert--Varshamov bound.
متن کاملTransitive and Self-dual Codes Attaining the Tsfasman-vladut-zink Bound
A major problem in coding theory is the question if the class of cyclic codes is asymptotically good. In this paper we introduce as a generalization of cyclic codes the notion of transitive codes (see Definition 1.4 in Section 1), and we show that the class of transitive codes is asymptotically good. Even more, transitive codes attain the Tsfasman-Vladut-Zink bound over Fq, for all squares q = ...
متن کاملStrengthening the Gilbert–Varshamov bound
The paper discusses some ways to strengthen (nonasymptotically) the Gilbert–Varshamov bound for linear codes. The unifying idea is to study a certain graph constructed on vectors of low weight in the cosets of the code, which we call the Varshamov graph. Various simple estimates of the number of its connected components account for better lower bounds on the minimum distance of codes, some of t...
متن کامل